Multiperfect numbers on lines of the Pascal triangle

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fermat Numbers in the Pascal Triangle

For any positive integer m let Fm = 2 2 + 1 be the mth Fermat number. In this short note we show that the only solutions of the diophantine equation Fm = ( n k ) are the trivial ones, i.e., those with k = 1 or n− 1.

متن کامل

Members of Binary Recurrences on Lines of the Pascal Triangle

In this paper, we look at a diophantine equation of the form un = ( x y ) , where (un)n≥0 is a binary recurrent sequence of integers. We show that if the pair of integers (x, y) belongs to a fixed line of the Pascal triangle, then the above equation has only finitely many positive integer solutions (n, x, y). A binary recurrent sequence of integers (un)n≥0 has u0, u1 ∈ Z and satisfies the recur...

متن کامل

ON THE EXISTENCE OF e-MULTIPERFECT NUMBERS

The sum of such divisors of N is. denoted by o '(N) , and the number of such divisors by T^\N) . By conventions 1 is an exponential divisor of itself, so that a(l) = 1. The functions j(XN) and o^K^) were introduced in [1] and have been studied in [1] and [2], An integer N is said to be e-perfect whenever o^\N) = 2N9 and g-multiperfect when o^\N) = kN for an integer k > 2. In [1] and [2], severa...

متن کامل

A Pascal-like Triangle Related to the Tribonacci Numbers

A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...

متن کامل

1 Matrices related to the Pascal triangle

for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with determinants of some minors of the above Pascal tria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2009

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2008.10.003